Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(x,y,f(z,u,v)) |
→ f(f(x,y,z),u,f(x,y,v)) |
|
There are 3 dependency pairs:
|
| 2: |
|
F(x,y,f(z,u,v)) |
→ F(f(x,y,z),u,f(x,y,v)) |
| 3: |
|
F(x,y,f(z,u,v)) |
→ F(x,y,z) |
| 4: |
|
F(x,y,f(z,u,v)) |
→ F(x,y,v) |
|
Consider the SCC {2-4}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006